Approximating Subadditive Hadamard Functions on Implicit Matrices

An important challenge in the streaming model is to maintain small-space approximations of entrywise functions performed on a matrix that is generated by the outer product of two vectors given as a stream. In other works, streams typically define matrices in a standard way via a sequence of updates, as in the work of Woodruff [22] and others. We describe the matrix formed by the outer product, and other matrices that do not fall into this category, as implicit matrices. As such, we consider the general problem of computing over such implicit matrices with Hadamard functions, which are functions applied entrywise on a matrix. In this paper, we apply this generalization to provide new techniques for identifying independence between two data streams. The previous state of the art algorithm of Braverman and Ostrovsky [9] gave a (1± )approximation for the L1 distance between the joint and product of the marginal distributions, using space O(log1024(nm) −1024), where m is the length of the stream and n denotes the size of the universe from which stream elements are drawn. Our general techniques include the L1 distance as a special case, and we give an improved space bound of O(log12(n) log2(nm ) −7). 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems